Using Satisfiability Modulo Theories to Analyze Abstract State Machines (Abstract)
نویسندگان
چکیده
State Machines Margus Veanes and Ando Saabas 1 Microsoft Research, Redmond, WA, USA [email protected] 2 Institute of Cybernetics Tallinn University of Technology, Tallinn, Estonia
منابع مشابه
Symbolic Bounded Model Checking of Abstract State Machines
Abstract State Machines (ASMs) allow modeling system behaviors at any desired level of abstraction, including a level with rich data types, such as sets or sequences. The availability of high-level data types allow state elements to be represented both abstractly and faithfully at the same time. AsmL is a rich ASM-based specification and programming language. In this paper we look at symbolic a...
متن کاملBlock-Wise Abstract Interpretation by Combining Abstract Domains with SMT
domains with SMT Jiahong Jiang, Liqian Chen, Xueguang Wu, and Ji Wang School of Computer Science, National University of Defense Technology, China State Key Laboratory of High Performance Computing, China {jhjiang,lqchen,xueguangwu,wj}@nudt.edu.cn Abstract. Statement-wise abstract interpretation that calculates the abstract semantics of a program statement by statement, is scalable but may caus...
متن کاملSMT-Based Automatic Proof of ASM Model Refinement
Model refinement is a technique indispensable for modeling large and complex systems. Many formal specification methods share this concept which usually comes together with the definition of refinement correctness, i.e., the mathematical proof of a logical relation between an abstract model and its refined models. Model refinement is one of the main concepts which the Abstract State Machine (AS...
متن کاملOn Bounded Reachability of Programs with Set Comprehensions
We analyze the bounded reachability problem of programs that use abstract data types and set comprehensions. Such programs are common as high-level executable specifications of complex protocols. We prove decidability and undecidability results of restricted cases of the problem and extend the Satisfiability Modulo Theories approach to support analysis of set comprehensions over tuples and bag ...
متن کاملAutomatically finding particular term rewriting systems
Our goal is to give a list of rewriting properties, and then automatically find a term rewriting system (TRS) satisfying these properties. In earlier work we did this for finite abstract reduction systems; in this paper we extend the approach to ground term rewriting systems over constants and one unary symbol. In particular, we fully automatically find a TRS that is locally confluent but not c...
متن کامل